منابع مشابه
Dynamic Network Adaptation Framework Employing Layered Relative Priority Index for Adaptive Video Delivery
Delivering high-quality media contents robustly over a wide range of network conditions of the wired/wireless Internet is a highly challenging task. To address this challenging task, the continuous media applications at the edge of network have become more and more adaptive while the best-effort Internet is slowly progressing towards improved networking services. Thus, the role of network adapt...
متن کاملPriority-based Network Services
Although today’s Internet predominantly uses the flat-fee pricing scheme, the need for more sophisticated pricing has grown, especially for domains where bandwidth resources are scarce and expensive. This paper focuses on how to determine the price vector that maximizes the system revenue in priority-based networks. Similar problems have been examined using equilibrium analysis, but the assumpt...
متن کاملMulti-Layered Network Embedding
Network embedding has gained more attentions in recent years. It has been shown that the learned lowdimensional node vector representations could advance a myriad of graph mining tasks such as node classification, community detection, and link prediction. A vast majority of the existing efforts are overwhelmingly devoted to single-layered networks or homogeneous networks with a single type of n...
متن کاملSignal Prediction by Layered Feed - Forward Neural Network (RESEARCH NOTE).
In this paper a nonparametric neural network (NN) technique for prediction of future values of a signal based on its past history is presented. This approach bypasses modeling, identification, and parameter estimation phases that are required by conventional parametric techniques. A multi-layer feed forward NN is employed. It develops an internal model of the signal through a training operation...
متن کاملPriority Arguments in Complexity Theory
machine-independent) complexity theory is basically a theory which establishes limits on what may be said about the complexity of specific recursive functions. (For example, the speed-up theorem [1] shows that it is not always possible to discover close upper and lower bounds for the complexity of a function.) As such, its basic proof method is diagonalization. Sacks, Spector, etc. [2], [3] hav...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2010
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-010-4047-0